翻訳と辞書 Words near each other ・ Toell the Great ・ Toen ・ Toen 't licht verdween ・ Toen Was Geluk Heel Gewoon ・ Toenailing ・ Toeni Department ・ Toensing (surname) ・ Toenut ・ Toepen ・ Toepfer International ・ Toepisa Gewog ・ Toepler pump ・ Toeplitz ・ Toeplitz algebra ・ Toeplitz Hash Algorithm ・ Toeplitz matrix ・ Toeplitz operator ・ Toeprinting assay ・ Toernich ・ Toes (Lights song) ・ Toes (Zac Brown Band song) ・ Toes in Tempo ・ Toes in the Sand Recordings ・ Toesca metro station ・ Toeshey ・ TOET (psychedelic) ・ Toetag Pictures ・ Toeterville, Iowa ・ Toeti Heraty ・ Toetoes Bay Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Toeplitz matrix ： ウィキペディア英語版 Toeplitz matrix In linear algebra, a Toeplitz matrix or diagonal-constant matrix, named after Otto Toeplitz, is a square matrix in which each descending diagonal from left to right is constant, e.g.: :$$ \begin a & b & c & d & e \\ f & a & b & c & d \\ g & f & a & b & c \\ h & g & f & a & b \\ i & h & g & f & a \end. Any ''n''×''n'' matrix ''A'' of the form :$$ A = \begin a_ & a_ & a_ & \ldots & \ldots &a_ \\ a_ & a_0 & a_ & \ddots & & \vdots \\ a_ & a_ & \ddots & \ddots & \ddots& \vdots \\ \vdots & \ddots & \ddots & \ddots & a_ & a_\\ \vdots & & \ddots & a_ & a_& a_ \\ a_ & \ldots & \ldots & a_ & a_ & a_ \end is a Toeplitz matrix. If the ''i'',''j'' element of ''A'' is denoted ''A''''i'',''j'', then we have :$A\_\; =\; A\_\; =\; a\_.\backslash$ ==Solving a Toeplitz system== A matrix equation of the form :$Ax=b\backslash$ is called a Toeplitz system if ''A'' is a Toeplitz matrix. If ''A'' is an $n\backslash times\; n$ Toeplitz matrix, then the system has only 2''n''−1 degrees of freedom, rather than ''n''2. We might therefore expect that the solution of a Toeplitz system would be easier, and indeed that is the case. Toeplitz systems can be solved by the Levinson algorithm in ''Θ''(''n''2) time. Variants of this algorithm have been shown to be weakly stable (i.e. they exhibit numerical stability for well-conditioned linear systems). The algorithm can also be used to find the determinant of a Toeplitz matrix in ''O''(''n''2) time. A Toeplitz matrix can also be decomposed (i.e. factored) in ''O''(''n''2) time. The Bareiss algorithm for an LU decomposition is stable. An LU decomposition gives a quick method for solving a Toeplitz system, and also for computing the determinant. Algorithms that are asymptotically faster (in finite arithmetic, i.e., given a tolerance $\backslash epsilon$ the exact solution is obtained within the tolerance $\backslash epsilon$) than those of Bareiss and Levinson have been described in the literature. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Toeplitz matrix」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.